Symbolic Reachability Analysis of FIFO - ChannelSystems with Nonregular Sets
نویسندگان
چکیده
We address the veriication problem of FIFO-channel systems by applying the symbolic analysis principle. We represent their sets of states (conngurations) using structures called CQDD's combining nite-state automata with linear constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets of conngurations. Moreover, we prove that CQDD's allow to compute the exact eeect of the repeated execution of any xed cycle in the transition graph of a system. We use this fact to deene a generic reachability analysis semi-algorithm parametrized by a set of cycles. Given a set of conngurations, this semi-algorithm performs a least xpoint calculation to construct the set of its successors (or predecessors). At each step, this calculation is accelerated by considering the cycles in as additional \meta-transitions" in the transition graph, generalizing the approach adopted in 5].
منابع مشابه
Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations
We address the veriication problem of FIFO-channel systems. We apply the symbolic analysis principle to these systems. We represent their sets of conngurations using structures called CQDD's combining nite-state automata with linear arith-metical constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets ...
متن کاملSymbolic Reachability Analysis of Fifo-channel Systems with Nonregular Sets of Conngurations
We address the veriication problem of FIFO-channel systems. We apply the symbolic analysis principle to these systems. We represent their sets of conng-urations using structures called CQDD's combining nite-state automata with linear arithmetical constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets ...
متن کاملRegular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models. More precisely, we consider the problem of computing effective representations of their reachability sets using finite-state automata. We show that, while forward reachability sets are not regular in general, backwa...
متن کاملUsing Forward Reachability Analysis for Verification of Lossy Channel Systems
We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class...
متن کاملThe Power of QDDs ( DRAFT )
Queue-content Decision Diagrams (QDDs) are nite-automaton based data structures for representing (possibly innnite) sets of contents of a nite collection of unbounded FIFO queues. Their intended use is to serve as a symbolic representation of the possible queue contents that can occur in the state space of a protocol modeled by nite-state machines communicating through unbounded queues. This is...
متن کامل